Near Optimal Solutions to the Grid Connection Problem
نویسندگان
چکیده
Stochastic optimization using simulated annealing has found wide applications in combinatorial optimization of NP-complete problems in recent years, especially in VLSI related problems. The Grid Connection Problem is a combinatorial optimization problem that is proven to be NP-complete. In this paper the simulated annealing algorithm has been applied to the Grid Connection Problem. We also propose an algorithm for the Grid Connection Problem based on certain heuristics, Results of our simulations show that while both algorithms do yield good solutions, those of the simulated annealing are superior to those of the heuristic algorithm, with rare exceptions.
منابع مشابه
Connection Interface Designing for Grid and Mobile Devices
There area lot of mobile computer devices with a variety of applications and users Tend to use them more. Due to the limitations of mobile devices, running most of the procedures are impossible. To resolve this problem, mobile devices can be connected to the grid, to use the facilities of grid. On the other hand the communication mechanisms are different for each device and they cannot be c...
متن کاملConnection Interface Designing for Grid and Mobile Devices
There area lot of mobile computer devices with a variety of applications and users Tend to use them more. Due to the limitations of mobile devices, running most of the procedures are impossible. To resolve this problem, mobile devices can be connected to the grid, to use the facilities of grid. On the other hand the communication mechanisms are different for each device and they cannot be c...
متن کاملOptimal Operation Management of Grid-connected Microgrid Using Multi-Objective Group Search Optimization Algorithm
Utilizing distributed generations (DGs) near load points has introduced the concept of microgrid. However, stochastic nature of wind and solar power generation as well as electricity load makes it necessary to utilize an energy management system (EMS) to manage hourly power of microgrid and optimally supply the demand. As a result, this paper utilizes demand response program (DRP) and battery t...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملA Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems
In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...
متن کامل